Dichroic subjettiness ratios to distinguish colour flows in boosted boson tagging
نویسندگان
چکیده
منابع مشابه
Maximizing Boosted Top Identification by Minimizing N-subjettiness
N -subjettiness is a jet shape designed to identify boosted hadronic objects such as top quarks. Given N subjet axes within a jet, N -subjettiness sums the angular distances of jet constituents to their nearest subjet axis. Here, we generalize and improve on N -subjettiness by minimizing over all possible subjet directions, using a new variant of the k-means clustering algorithm. On boosted top...
متن کاملCan Colour-Blind Distinguish Colour Palettes?
Let c : E(G) → [k] be a colouring, not necessarily proper, of edges of a graph G. For a vertex v ∈ V , let c(v) = (a1, . . . , ak), where ai = |{u : uv ∈ E(G), c(uv) = i}|, for i ∈ [k]. If we re-order the sequence c(v) non-decreasingly, we obtain a sequence c∗(v) = (d1, . . . , dk), called a palette of a vertex v. This can be viewed as the most comprehensive information about colours incident w...
متن کاملColour-blind Can Distinguish Colour Pallets
Let c : E → {1, . . . , k} be an edge colouring of a connected graph G = (V,E). Each vertex v is endowed with a naturally defined pallet under c, understood as the multiset of colours incident with v. If δ(G) > 2, we obviously (for k large enough) may colour the edges of G so that adjacent vertices are distinguished by their pallets of colours. Suppose then that our coloured graph is examined b...
متن کاملHiggs Boson Discovery with Boosted Trees
The discovery of the Higgs boson is remarkable for its importance in modern Physics research. The next step for physicists is to discover more about the Higgs boson from the data of the Large Hadron Collider (LHC). A fundamental and challenging task is to extract the signal of Higgs boson from background noises. The machine learning technique is one important component in solving this problem. ...
متن کاملTagging heavy flavours with boosted decision trees
This paper evaluates the performance of boosted decision trees for tagging b-jets. It is shown, using a Monte Carlo simulation of WH → lνqq̄ events that boosted decision trees outperform feed-forward neural networks. The results show that for a b-tagging efficiency of 90% the b-jet purity given by boosted decision trees is almost 20% higher than that given by neural networks.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of High Energy Physics
سال: 2017
ISSN: 1029-8479
DOI: 10.1007/jhep03(2017)022